A Remark about Combings of Groups
نویسندگان
چکیده
In the last several years a remarkable interplay between geometry, group theory, and the theory of formal languages has led to developments including the introduction of automatic groups [Ep+], hyperbolic groups [Gro], and geometric and language-theoretic characterizations of finitely generated virtually free groups [MS1] [MS2]. A prime example of such interplay is the study of combings, which were introduced in [Ep+, Chapter 3.6]. A combing is simply a choice of normal form for group elements relative to a fixed finite set of generators, but typically the set of words in normal form is required to satisfy language theoretic constraints when viewed as a formal language over the alphabet of generators, and geometric constraints when interpreted as a collection of paths in the Cayley graph of the group. For example, a group G is said to be automatic [Ep+] if for some finite set of generators it has a set of normal forms which is a regular language and has the property that the paths determined by normal forms for nearby elements are uniformly close, i.e., there exists a constant K > 0 such that points travelling at unit speed along two such paths which end a distance 1 apart stay K-close; this last condition is called the synchronous fellow traveller property. If these two conditions hold for one finite set of generators then they hold for all. Language theoretic and geometric conditions afford new ways of looking at finitely generated groups, and it is of interest to consider how various classes of groups may be characterized in terms of the combings which they admit. A well known open question in the study of automatic groups is whether or not one needs to include the language theoretic constraint of regularity in the definition. Might it be the case that every group which admits a set of normal forms satisfying the synchronous fellow traveller property is automatic, i.e., admits a regular set of normal forms satisfying the synchronous fellow traveller property? It seems highly unlikely that this will turn out to be the case, and various possible counterexamples have been proposed, including the three dimensional Heisenberg groupH3, and irreducible uniform lattices in Sl2(R)× Sl2(R). However, despite much effort, this question remains unresolved. What is known is that H3 provides a counterexample to the analogous question involving the asynchronous fellow traveller property. This
منابع مشابه
Combings of Groups and the Grammar of Reparameterization
A new construction of combings is used to distinguish between several previously indistinguishable classes of groups associated to the theory of automatic groups and non-positive curvature in group theory. We construct synchronously bounded combings for a class of groups that are neither bicombable nor automatic. The linguistic complexity of these combings is analysed: in many cases the languag...
متن کاملA Note on the Grammar Of Combings
Explicit constructions are given to illustrate the loss of control that ensues when one replaces the regular languages of automatic group theory with larger families of languages. The results of [2] show that one can distinguish between various classes of combable groups by analyzing the grammatical complexity of the combings that the groups admit. That work clarifies the boundaries of automati...
متن کاملA language theoretic analysis of combings
A group is combable if it can be represented by a language of words satisfying a fellow traveller property; an automatic group has a synchronous combing which is a regular language. This paper gives a systematic analysis of the properties of groups with combings in various formal language classes, and of the closure properties of the associated classes of groups. It generalises previous work, i...
متن کاملCombing Nilpotent and Polycyclic Groups
The notable exclusions from the family of automatic groups are those nilpotent groups which are not virtually abelian, and the fundamental groups of compact 3-manifolds based on the Nil or Sol geometries. Of these, the 3-manifold groups have been shown by Bridson and Gilman to lie in a family of groups defined by conditions slightly more general than those of automatic groups, that is, to have ...
متن کاملTame combings, almost convexity and rewriting systems for groups
A finite complete rewriting system for a group is a finite presentation which gives an algorithmic solution to the word problem. Finite complete rewriting systems have proven to be useful objects in geometric group theory, yet little is known about the geometry of groups admitting such rewriting systems. We show that a group G with a finite complete rewriting system admits a tame 1-combing; it ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJAC
دوره 3 شماره
صفحات -
تاریخ انتشار 1993